Dispatching Rule-Based Single Machine Static Scheduling of Crankcase Covers

The research focuses on the multi-objective single-machine static scheduling problems of motorcycle crankcase cover. To solve these problems, dispatching rules are used. Various used in this study earliest due date (EDD), shortest processing time (SPT), critical ratio (CR), longest (LPT), weightage (WSPT), cost over (COVERT), and hodgson’s algorithm. objective paper is to sequence different covers minimize average flow time, an hour early, past due, etc. This helps us obtain optimal job prioritization two-wheeler automobile industry. Results show that shifting production system from WSPT approach EDD approach, minimizes mean by 2.75%, weighted 27.91%, maximum lateness 21.87%.